Practical comparison of approximation algorithms for scheduling problems
نویسندگان
چکیده
منابع مشابه
Practical Comparison of Approximation Algorithms for Scheduling Problems
In this paper we consider an experimental study of approximation algorithms for scheduling problems in parallel machines minimizing the average weighted completion time. We implemented approximation algorithms for the following problems: , , , and . We generated about 900 tests over more than 190 different instances and present some practical aspects of the implemented algorithms. We also made ...
متن کاملApproximation algorithms for stochastic scheduling problems
In this dissertation we study a broad class of stochastic scheduling problems characterized by the presence of hard deadline constraints. The input to such a problem is a set of jobs, each with an associated value, processing time, and deadline. We would like to schedule these jobs on a set of machines over time. In our stochastic setting, the processing time of each job is random, known in adv...
متن کاملParallel Comparison Algorithms for Approximation Problems
Suppose we have n elements from a totally ordered domain, and we are allowed to perform p parallel comparisons in each time unit (round). In this paper we determine, up to a constant factor, the time complexity of several approximation problems in the common parallel comparison tree model of Valiant, for all admissible values of n, p and e, where e is an accuracy parameter determining the quali...
متن کاملOn optimality of exact and approximation algorithms for scheduling problems
We consider the classical scheduling problem on parallel identical machines to minimize the makespan. Under the exponential time hypothesis (ETH), lower bounds on the running times of exact and approximation algorithms are characterized. We achieve the following results: (1) For scheduling on a constant number m of identical machines, denoted by Pm||Cmax, a fully polynomial time approximation s...
متن کاملA Comparison of Optimization Algorithms for Practical Staff Scheduling Problems in Logistics and Retailing
The current paper uses real-life scenarios of staff scheduling applications to compare the effectiveness and efficiency of two fundamentally different solution approaches. One can be called centralised and is based on search in the solution space with two adapted metaheuristic, namely particle swarm optimization (PSO) and evolution strategy (ES). The second approach, a multi-agent system (MAS),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pesquisa Operacional
سال: 2004
ISSN: 0101-7438
DOI: 10.1590/s0101-74382004000200002